Analyzing Discrete Movement Data as a Correlated Random Walk
نویسندگان
چکیده
منابع مشابه
A Turing model with correlated random walk
If in the classical Turing model the diffusion process (Brownian motion) is replaced by a more general correlated random walk, then the parameters describing spatial spread are the particle speeds and the rates of change in direction. As in the Turing model, a spatially constant equilibrium can become unstable if the different species have different turning rates and different speeds. Furthermo...
متن کاملContinuous-time correlated random walk model for animal telemetry data.
We propose a continuous-time version of the correlated random walk model for animal telemetry data. The continuous-time formulation allows data that have been nonuniformly collected over time to be modeled without subsampling, interpolation, or aggregation to obtain a set of locations uniformly spaced in time. The model is derived from a continuous-time Ornstein-Uhlenbeck velocity process that ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملBridging the gulf between correlated random walks and Lévy walks: autocorrelation as a source of Lévy walk movement patterns.
For many years, the dominant conceptual framework for describing non-oriented animal movement patterns has been the correlated random walk (CRW) model in which an individual's trajectory through space is represented by a sequence of distinct, independent randomly oriented 'moves'. It has long been recognized that the transformation of an animal's continuous movement path into a broken line is n...
متن کاملAnalyzing the Random-Walk Algorithm for SAT
The propositional logic satisfiability (SAT) problem has gained growing interest in recent years. From complexity theory is known that many real-world mathematical and engineering problems can be translated into SAT problem instances. Advances on SAT solution algorithms in the past ten or fifteen years has enabled solving these problems by a computer. This, for one, has inspired developing even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ecology
سال: 1989
ISSN: 0012-9658
DOI: 10.2307/1937543